Capacity of Gaussian Many-Access Channels
نویسندگان
چکیده
منابع مشابه
Secrecy Capacity Region of Binary and Gaussian Multiple Access Channels
Abstract— A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for the destination. Moreover, user 1 wishes to keep its confidential information as secret as possible from user 2. A deterministic GMAC is first studie...
متن کاملFDMA capacity of Gaussian multiple-access channels with ISI
This paper proposes a numerical method for characterizing the rate region achievable with frequency-division multiple access (FDMA) for a Gaussian multiple-access channel with intersymbol interference. The frequency spectrum is divided into discrete frequency bins and the discrete bin-assignment problem is shown to have a convex relaxation, making it tractable to numerical optimization algorith...
متن کاملLinear Sum Capacity for Gaussian Multiple Access Channels with Feedback
The capacity region of the N -sender additive white Gaussian noise (AWGN) multiple access channel (MAC) with feedback is not known in general, despite significant contributions by Cover, Leung, Ozarow, Thomas, Pombra, Ordentlich, Kramer, and Gastpar. This paper studies the class of generalized linear feedback codes that includes (nonlinear) nonfeedback codes at one extreme and the linear feedba...
متن کاملOn the Sum Capacity of Many-to-one and One-to-many Gaussian Interference Channels
We obtain new sum capacity results for the Gaussian many-to-one and one-to-many interference channels in channel parameter regimes where the sum capacity was known only up to a constant gap. Simple HanKobayashi (HK) schemes, i.e., HK schemes with Gaussian signaling, no time-sharing, and no common-private power splitting, achieve sum capacity under the channel conditions for which the new result...
متن کاملInformation Capacity of Gaussian Channels
i Information capacity of Gaussian channels is one of the basic problems of information theory. Shannon's results for white Gaussian channels and Fano's "waterfilling" analysis of stationary Gaussian channels are two of the best-known works of early information theory. Results are given here which extend to a general framework these results and others due to Gallager and to Kadota, Zakai, and Z...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2668391